Optimal Interpolator Using a Trigonometric Polynomial

نویسندگان

  • Dengwei Fu
  • Alan N. Willson
چکیده

All-digital approaches for the adjustment of timing offset in digital modems have attracted increasing attention. We recently announced a novel interpolation method which, instead of approximating the continuous-time signal with a conventional polynomial and computing the synchronized samples using a Farrow structure, uses a trigonometric polynomial. Simulation results indicate that improved performance, reduced computational delay and, in most cases, simplified hardware can be achieved. To recover a synchronized sample from existing samples, given a timing offset, we show here that we can optimize this method such that the interpolation error in the recovered sample is minimized for that specific timing offset value. Using this optimization technique, the overall interpolation error is reduced. As for the implementation, the optimal interpolator does not require additional hardware as compared to our original method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deterministic Sampling of Sparse Trigonometric Polynomials

One can recover sparse multivariate trigonometric polynomials from few randomly taken samples with high probability (as shown by Kunis and Rauhut). We give a deterministic sampling of multivariate trigonometric polynomials inspired by Weil’s exponential sum. Our sampling can produce a deterministic matrix satisfying the statistical restricted isometry property, and also nearly optimal Grassmann...

متن کامل

Minimization of Errors of the Polynomial- Trigonometric Interpolation with Shifted Nodes∗

The polynomial-trigonometric interpolation based on the Krylov approach for a smooth function given on [-1, 1] is defined on the union of m shifted each other uniform grids with the equal number of points. The asymptotic errors of the interpolation in both uniform and L2 metrics are investigated. It turned out that the corresponding errors can be minimized due to an optimal choice of the shift ...

متن کامل

Active Learning for Optimal Generalization in Trigonometric Polynomial Models

In this paper, we consider the problem of active learning, and give a necessary and sufficient condition of sample points for the optimal generalization capability. By utilizing the properties of pseudo orthogonal bases, we clarify the mechanism of achieving the optimal generalization capability. We also show that the condition does not only provide the optimal generalization capability but als...

متن کامل

Training Data Selection for Optimal Generalization in Trigonometric Polynomial Networks

In this paper, we consider the problem of active learning in trigonometric polynomial networks and give a necessary and sufficient condition of sample points to provide the optimal generalization capability. By analyzing the condition from the functional analytic point of view, we clarify the mechanism of achieving the optimal generalization capability. We also show that a set of training examp...

متن کامل

Norming meshes by Bernstein-like inequalities

We show that finite-dimensional univariate function spaces satisfying a Bernstein-like inequality admit norming meshes. In particular, we determine meshes with “optimal” cardinality for trigonometric polynomials on subintervals of the period. As an application we discuss the construction of optimal bivariate polynomial meshes by arc blending. 2000 AMS subject classification: 26D05, 42A05, 65T40.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998